Irreducible powerful ray pattern matrices
نویسندگان
چکیده
منابع مشابه
Powers of Ray Pattern Matrices
We examine the similarities and differences between results for powers of sign pattern matrices and for powers of ray pattern matrices. In particular, we investigate what is known about k-potent patterns and powerful patterns in both the irreducible and reducible cases. 1 Signs, Rays, Sign & Ray Patterns Since at least the 1960’s, the qualitative theory of real matrices has been an extremely fr...
متن کاملIrreducible Toeplitz and Hankel matrices
An infinite matrix is called irreducible if its directed graph is strongly connected. It is proved that an infinite Toeplitz matrix is irreducible if and only if almost every finite leading submatrix is irreducible. An infinite Hankel matrix may be irreducible even if all its finite leading submatrices are reducible. Irreducibility results are also obtained in the finite cases.
متن کاملSign Pattern Matrices that Admit P0 Matrices
A P0-matrix is a real square matrix all of whose principle minors are nonnegative. In this paper, we consider the class of P0-matrix. Our main aim is to determine which sign pattern matrices are admissible for this class of real matrices. Keywords—Sign pattern matrices, P0 matrices, graph, digraph
متن کاملMaterialization: A Powerful and Ubiquitous Abstraction Pattern
Materialization is a useful abstraction pattern that can be identified in many application settings. Intuitively, materialization is the relationship between a class of categories (e.g., models of cars) and a class of more concrete objects (e.g., individual cars). This paper gives a quasi-formal semantic definition of materialization in terms of the usual is-a and isof abstractions, and of a cl...
متن کاملProducts of irreducible random matrices in the (Max,+) Algebra
We consider the recursive equation “x(n + 1) = A(n) ⊗ x(n)” where x(n + 1) and x(n) are Rk-valued vectors and A(n) is an irreducible random matrix of size k × k. The matrix-vector multiplication in the (max,+) algebra is defined by (A(n) ⊗ x(n))i = maxj(Aij(n) + xj(n)). This type of equation can be used to represent the evolution of Stochastic Event Graphs which include cyclic Jackson Networks,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2002
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(01)00436-0